Network coding matrix re-creation mechanism was used to guarantee a100% success probability of decoding. 利用网络编码矩阵重新生成机制以保证100%解码成功率;
By a general process named sum-product algorithm that distributed propagate the probability information in the corresponding factor graph, many problems can be solved, and the iterative decoding algorithm of turbo codes can also be viewed as a special instance of sum-product algorithm. 通过在相应因子图上分布地进行概率信息传播的和积算法,可以实现许多问题的求解,Turbo码的迭代译码算法也可以看作是和积算法的一个特例。
It divides the signal constellations into the subsets specified by each binary digit, and then maps the soft symbol information to soft bit information by Maximum-A-posteriori Probability ( MAP) algorithm to realize the binary decoding. 它对每个比特划分对应的星座点集合,然后将对应的符号软信息通过MAP算法映射成为比特软信息的方法,从而实现二进制译码。
To fully make use of the information on the deterministic structure of turbo constituent encoders according to the algebraic decoding principle in conjunction with the probabilitic decoding algorithm, this paper proposed a joint probability algebra decoding scheme for turbo codes. 本文在保持Turbo码迭代软解码算法优点的基础上,充分利用Turbo码编码器结构这一确知条件,结合代数解码原理,提出了一种Turbo码概率代数联合解码算法。
Mandarin Digit String Recognition Based on Segment Model Using Posterior Probability Decoding 基于后验概率解码段模型的汉语语音数字串识别
Viterbi decoding algorithm using the probability technology is an effective method for the TCM decoding. It can fully embody the advantages of TCM. 而目前对格状编码调制进行译码的有效手段是应用概率译码技术的维特比(Viterbi)译码算法,可以充分地体现TCM的优点。
Two novel type of soft-output decoding algorithms for turbo codes with a convolutional interleaver is proposed, based on a decision rule of symbol-by-symbol maximum a posteriori ( MAP) probability. Each of them requires only a forward recursion and has lower decoding delay. 基于最大后验概率判决准则,提出了两种只有前向递推的软输出译码算法,它们具有较低的译码延迟,可用于面向连续比特流的turbo码中。
A special algorithm named "probability trace back" is developed based on our research of the existed trace back algorithms and some Stat. By using it, the decoding latency as well as the memory space in the trace back component is reduced. 通过对现有回溯算法的分析和回溯过程的统计,我们提出了基于前向回溯算法的概率回溯算法,从而在减小回溯部件所需存储空间的同时降低了译码器的译码延迟。
We also use Pearl's probability propagation algorithm to show the appropriateness of the serial decoding method. 采用人工智能中的贝叶斯网络概率传播算法对串行译码方法的合理性给出了证明。
The Viterbi algorithm is known to be an efficient method for the realization of maximum likelihood probability ( MLP) decoding of convolutional codes. Viterbi译码算法是基于最大似然概率的卷积码译码算法。
The traditional decoding methods of convolutional code can be classified into two types: threshold decoding and probability decoding. The latter can be divided into sequential decoding and Viterbi algorithm. 卷积码的传统译码方法有两大类:一类是门限译码,另一类是概率译码,概率译码又分为序列译码和维特比译码。
From the results, that these kinds noise's probability distribution function of the reconstructed image is Gaussian form are found, and the double-random phase decoding operation will not degrade the signal-noise ratio of the images. 研究表明,这几种类型的数据偏差在重构图像中均会导致灰度值概率分布为高斯型函数的噪声。
This paper employs the codeword-error probability to evaluate the performance of interleaved Reed-Solomon ( RS) codes on simplified GE channel by the two-order method and the one-order method respectively when using error-only decoding strategy. 当使用仅纠错译码方法时,本文分别采用二阶方法和一阶方法,以误字率评价交织Reed-Solomon(RS)码在简化GE信道上的性能。
Theoretical proved that relative to the random linear network coding, the successful decoding probability of joint block random network coding is increasing, but the decoding time is reduced. 通过理论证明,应用反馈机制后,相对于随机网络编码,联合分块网络编码成功解码的概率提高了,而解码时间复杂度降低了。
Therefore, we propose a Best Effort-based overhearing management policy, which improves the probability of cached packets to be used for decoding, and thus increases the system throughput. 为此,提出了一种基于尽力服务的侦听管理策略,提高了侦听缓存中数据包被用作解码的概率,进而提高了系统吞吐量。
When we are decoding, the two groups of error-correct code can monitor each other, so that, the probability of false-normal decoding is reduced. 解码时,两组纠错码可以相互监督,减少伪正常解码的情况。
In order to increase the probability of correcting the error frame, we should have many rounds of BP decoding. 为了增大纠错成功的概率,需要通过多轮再迭代译码。
Incremental redundancy technology is proposed to instead of traditional Chase merger, which combine incremental redundancy transmission is mainly incremental redundancy code word, to increase the probability of correct decoding and increase the data throughput. 论文提出将递增冗余技术代替传统Chase合并方案,递增冗余合并主要是递增发送的码字的冗余度,:以增大正确译码的概率,增加数据吞吐量。
At encoder side, we will study how to adopt multiple description coding ( MDC) technology to reduce error probability, and make sure decoding continues even when errors occur. 在编码器端,研究如何使用多描述编码技术尽可能降低视频发生随机误码的概率,并且即使在编码视频流受损时也可保证在解码不受影响。
In the scatter density evolution analysis, we get the evolution of the bit error probability in iterative decoding and the convergence of it under the control of a given original bit error probability. 在离散密度进化分析中,使用了Gallager最早提出的硬判决译码算法,获得了迭代译码中误码率的进化,得到在一定初始误码率的条件下,译码误码率的收敛情况。
According to the principle of minimum distance decoding, we can detect the original copyright watermark to some corresponding user. With the establishment of the channel transition probability matrix, we can analyze probability of incorrectly classifying among the copyright watermarks and discuss the best decoding principle. 我们根据最小距离译码准则,从版权水印中找出该用户的原对应水印,并且结合信道转移概率矩阵,分析了版权水印之间的误判概率并讨论了最佳译码准则。
According to the diffuse error rate problem, firstly, we decode VLC based on the maximum a posteriori probability. Then, optimize VLC-Viterbi grid searching method based on bit to forming a new VLC-Viterbi decoding algorithm. 针对VLC的误码扩散问题,先将VLC进行最大后验概率译码,再对基于比特的VLC-Viterbi网格搜索方法优化,形成改进的VLC-Viterbi译码算法。